Quantifying Urban Network Transitions with Evolution Degree

نویسندگان

چکیده

Abstract This paper proposes a graph-based mathematical approach with novel metric, the Structure Evolution Degree, to quantitatively analyze urban spatial structure transitions at cross scale and verifies its effectiveness through two cases studies, San Bartolomeo Quarter of Venice Xiaoxihu Historical Block Nanjing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantifying long-term evolution of intra-urban spatial interactions

Understanding the long-term impact that changes in a city's transportation infrastructure have on its spatial interactions remains a challenge. The difficulty arises from the fact that the real impact may not be revealed in static or aggregated mobility measures, as these are remarkably robust to perturbations. More generally, the lack of longitudinal, cross-sectional data demonstrating the evo...

متن کامل

Quantifying Urban Traffic Anomalies

Detecting and quantifying anomalies in urban traffic is critical for real-time alerting or re-routing in the short run and urban planning in the long run. We describe a two-step framework that achieves these two goals in a robust, fast, online, and unsupervised manner. First, we adapt stable principal component pursuit to detect anomalies for each road segment. This allows us to pinpoint traffi...

متن کامل

Urban settlement transitions

Urban growth dynamics attracts the efforts of scientists from many different disciplines with objectives ranging from theoretical understanding to the development of carefully tuned realistic models that can serve as planning and policy tools. Theoretical models are often abstract and of limited applied value while most applied models yield little theoretical understanding. Here we present a ma...

متن کامل

Network-Design with Degree Constraints

We study several network design problems with degree constraints. For the degree-constrained 2-connected subgraph problem we obtain a factor 6 violation for the degrees with 4 approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2006). Then we consider the problem of finding an arborescence with at least k ter...

متن کامل

Quantifying schema evolution

Achieving correct changes is the dominant activity in the application software industry. Modification of database schemata is one kind of change which may have severe consequences for database applications. The paper presents a method for measuring modifications to database schemata and their consequences, by using a thesaurus tool. Measurements of the evolution of a large-scale database applic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nexus Network Journal

سال: 2023

ISSN: ['1590-5896', '1522-4600']

DOI: https://doi.org/10.1007/s00004-023-00674-8